An Anonymous Mobile Payment System Based on Bilinear Pairings
نویسندگان
چکیده
منابع مشابه
An Anonymous Mobile Payment System Based on Bilinear Pairings
Many electronic cash systems have been proposed with the proliferation of the Internet and the activation of electronic commerce. E-cash enables the exchange of digital coins with value assured by the bank’s signature and with concealed user identity. In an electronic cash system, a user can withdraw coins from the bank and then spends each coin anonymously and unlinkably. In this paper, we des...
متن کاملAn ID-based Anonymous Proxy Signature From Bilinear Pairings
Abstract: A new ID-based anonymous proxy signature scheme from bilinear pairings was proposed in this paper. Anonymous proxy signature is suitable for the situation that the proxy signer’s identity needs to be kept secret. The verifier needs to reveal the real identity of the proxy signer with the help of the original signer. The signature is based on Gap Diffie-Hellman group problems and meets...
متن کاملAn ID-Based Anonymous Proxy Chameleon Signature Based on Bilinear Pairings
Anonymous proxy signature is suitable for the situation where the proxy signer's identity needs to be kept secret. The verifier needs to reveal the real identity of the proxy signer with the help of the original signer. A new ID-based anonymous proxy chameleon signature scheme based on bilinear pairing is proposed in this paper. This scheme is based on Gap Diffie-Hellman group and meets the sec...
متن کاملAn Anonymous Mobile Payment System based on a Group Blind Signature Scheme
In this paper we propose an anonymous mobile payment system based on a group blind signature scheme in order to prevent blackmailing. The message transfer from the customer to the merchant occurs only once during the payment protocol. Also, the amount of communication between customer and merchant is about 900 Bytes. Therefore, our mobile payment system can be used in the wireless networks with...
متن کاملAn Effective Certificateless Signature Scheme Based on Bilinear Pairings
In this paper we propose a certificateless signature scheme based on bilinear pairings. The scheme effectively removes secure channel for key issuance between trusted authority and users and avoids key escrow problem, which is an inherent drawback in ID-based cryptosystems. The scheme uses a simple blinding technique to eliminate the need of secure channel and user chosen secret value to avoid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2009
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2009.267